package LeetCode.month03.day72;

import java.util.Arrays;

/**
 * @author 16778
 * @date 2025/10/11 8:37
 * @description
 */
public class No740 {
    public int deleteAndEarn(int[] nums) {
        Arrays.sort(nums);
        int n = nums.length;
        int[] arr = new int[nums[n-1]+1];
        for (int num : nums) {
            arr[num]+=num;
        }
        return rob(arr);
    }

    public int rob(int[] nums) {
        int n = nums.length;
        if (n == 1) {
            return nums[0];
        }
        int[] dp = new int[n];
        dp[0] = nums[0];
        dp[1] = Math.max(nums[0], nums[1]);
        for (int i = 2; i < n; i++) {
            dp[i] = Math.max(dp[i-1], dp[i-2]+nums[i]);
        }
        return dp[n-1];
    }
}
